Bound entanglement helps to reduce communication complexity
نویسندگان
چکیده
منابع مشابه
A Lower Bound on Entanglement-Assisted Quantum Communication Complexity
We prove a general lower bound on the bounded-error entanglement-assisted quantum communication complexity of Boolean functions. The bound is based on the concept that any classical or quantum protocol to evaluate a function on distributed inputs can be turned into a quantum communication protocol. As an application of this bound, we give a very simple proof of the statement that almost all Boo...
متن کاملQuantum Entanglement and Communication Complexity
We consider a variation of the multi-party communication complexity scenario where the parties are supplied with an extra resource: particles in an entangled quantum state. We show that, although a prior quantum entanglement cannot be used to simulate a communication channel, it can reduce the communication complexity of functions in some cases. Specifically, we show that, for a particular func...
متن کاملMulti-partite entanglement, communication complexity and quantum Helly-type theorems
We develop protocols for preparing the GHZ state (a pure tri-partite maximally entangled state) and, in general, a pure n-partite maximally entangled state using EPR pairs shared amongst n agents and classical communication between the agents. We observe that the combinatorial arrangement of EPR pairs required for this purpose is like that in Helly-type theorems in geometry. PACS numbers: 03.65...
متن کاملCommunication complexity of remote state preparation with entanglement
Definition 1 (Remote state preparation) Let Alice, who knows the function E, get an input x ∈ X. Alice and Bob are required to communicate and at the end of the communication Bob should have a quantum state ρx such that F (ρx, E(x)) ≥ 1− ǫ, for some 0 ≤ ǫ < 1. Alice and Bob may start with some prior entanglement between them. In several papers in the remote state preparation problem, Alice inst...
متن کاملHow Quantum Entanglement Helps to Coordinate Non-Communicating Players
We consider a coalitional game with the same payoff for all players. To maximize the payoff, the players need to use one collective strategy, if all players are in certain states, and the other strategy otherwise. The current state of each player changes according to external conditions and is not known to the other players. In one example of such a game, quantum entanglement between players re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2013
ISSN: 1050-2947,1094-1622
DOI: 10.1103/physreva.87.032305